Sound reasoning in tock-CSP

Hierarchical Reasoning in Probabilistic CSP

Probabilistic CSP extends the language of CSP with an operator for probabilistic choice. However reasoning about an intricate combination of nondeterminism, communication and probabilistic behaviour can be complicated. In standard CSP, and in formal methods generally, such complication is overcome (when possible) by use of hierarchical reasoning. In this paper we provide a foundation for liftin...

Combining Formal Reasoning Techniques with CSP

A Taste of Sound Reasoning in Faust

We address the question of what software verification can do for the audio community by showcasing some preliminary design ideas and tools for a new framework dedicated to the formal reasoning about Faust programs. We use as a foundation one of the strongest current proof assistants, namely Coq combined with SSReflect. We illustrate the practical impact of our approach via a use case, namely th...

Qualitative CSP, Finite CSP, and SAT: Comparing Methods for Qualitative Constraint-based Reasoning

Qualitative Spatial and Temporal Reasoning (QSR) is concerned with constraint-based formalisms for representing, and reasoning with, spatial and temporal information over infinite domains. Within the QSR community it has been a widely accepted assumption that genuine qualitative reasoning methods outperform other reasoning methods that are applicable to encodings of qualitative CSP instances. R...

A Reasoning Method for Timed CSP Based on Constraint Solving

Timed CSP extends CSP by introducing a capability to quantify temporal aspects of sequencing and synchronization. It is a powerful language to model real time reactive systems. However, there is no verification tool support for proving critical properties over systems modelled using Timed CSP. In this work, we construct a reasoning method using Constraint Logic Programming (CLP) as an underlyin...